package cn.pugle.oj.leetcode;

import cn.pugle.oj.catalog.DynamicProblem;

import java.util.Arrays;

/**
 * 不能类似322的思路. dp(x-i1) + dp(x-i2) + dp(x-i2)多个方案直接加和有重复的
 *
 * @author tzp
 * @since 2020/9/22
 */
public class LC518 implements DynamicProblem {

    public int change(int amount, int[] coins) {
        int[] dp = new int[amount + 1];
        Arrays.fill(dp, -1);
        return -1;
    }

    public int re(int amount, int[] coins, int[] dp) {
        if (amount < 0) return 0;
        if (dp[amount] != -1) return dp[amount];
        return -1;
    }

    public static void main(String[] args) {
        System.out.println(new LC518().change(5, new int[]{1, 2, 5}));
    }
}
